Sylvester rank functions for amenable normal extensions

نویسندگان

چکیده

We introduce a notion of amenable normal extension S unital ring R with finite approximation system F, encompassing the algebras over field Gromov and Elek, twisted crossed product by an group, tensor extension. It is shown that every Sylvester matrix rank function rk preserved has canonical to rk_F for S. In case extension, it also depends on continuously. When group action C*-algebra preserving tracial state, we show two natural functions algebraic constructed out state coincide.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extensions of Positive Definite Functions on Amenable Groups

Let S be a subset of a amenable group G such that e ∈ S and S = S. The main result of the paper states that if the Cayley graph of G with respect to S has a certain combinatorial property, then every positive definite operator-valued function on S can be extended to a positive definite function on G. Several known extension results are obtained as a corollary. New applications are also presented.

متن کامل

Extensions of amenable groups by recurrent groupoids

We show that amenability of a group acting by homeomorphisms can be deduced from a certain local property of the action and recurrency of the orbital Schreier graphs. This applies to a wide class of groups, amenability of which was an open problem, as well as unifies many known examples to one general proof. In particular, this includes Grigorchuk’s group, Basilica group, groups associated with...

متن کامل

The Poisson Boundary of Amenable Extensions

One of the most operational deenitions of amenability is given in terms of asymptot-ically invariant sequences of probability measures. For locally compact groups this is the Reiter condition (e.g., see Gr69]): a group G is amenable ii there exists a sequence of probability measures n on G such that kg n ? n k ! 0 for any g 2 G, where kk stands for the total variation of a measure. Deenitions o...

متن کامل

A Structured Rank - Revealing Method for Sylvester Matrix 1 )

We propose a displacement structure based rank-revealing algorithm for Sylvester matrix, then apply it to compute approximate greatest common division of two univariate polynomials with floating-point coefficients. This structured rank-revealing method is based on a stabilized version of the generalized Schur algorithm [8], and is a fast rank-revealing method in the sense that, all computations...

متن کامل

Index Coding: Rank-Invariant Extensions

An index coding (IC) problem consisting of a server and multiple receivers with different side-information and demand sets can be equivalently represented using a fitting matrix. A scalar linear index code to a given IC problem is a matrix representing the transmitted linear combinations of the message symbols. The length of an index code is then the number of transmissions (or equivalently, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Analysis

سال: 2021

ISSN: ['0022-1236', '1096-0783']

DOI: https://doi.org/10.1016/j.jfa.2020.108913